A new algorithm for the Chebyshev solution of overdetermined linear systems
نویسندگان
چکیده
منابع مشابه
A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems
Let x(p) be the point which minimizes the residual of a linear system in the lv norm. It is known that under certain conditions x(p) —» x*, the Chebyshev or /„ solution, as p —y <*>. A differential equation describing x(p) is derived from which an iterative scheme is devised. A convergence analysis is given and numerical results are presented.
متن کاملComputing the Strict Chebyshev Solution of Overdetermined Linear Equations
A method for calculating the strict Chebyshev solution of overdetermined systems of linear equations using linear programming techniques is described. This method provides: (1) a way to determine, for the majority of cases, all the equations belonging to the characteristic set, (2) an efficient method to obtain the inverse of the matrix needed to calculate the strict Chebyshev solution, and (3)...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولA fractional type of the Chebyshev polynomials for approximation of solution of linear fractional differential equations
In this paper we introduce a type of fractional-order polynomials based on the classical Chebyshev polynomials of the second kind (FCSs). Also we construct the operational matrix of fractional derivative of order $ gamma $ in the Caputo for FCSs and show that this matrix with the Tau method are utilized to reduce the solution of some fractional-order differential equations.
متن کاملSolution to Overdetermined Linear Equations
It has been known for many years that a robust solution to an overdetermined system of linear equations Ax b is obtained by minimizing the L1 norm of the residual error. A correct solution x to the linear system can often be obtained in this way, in spite of large errors (outliers) in some elements of the (m n) matrix A and the data vector b. This is in contrast to a least squares solution, whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1974
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1974-0334482-3